Greedy clique decompositions and the Turán numbers
نویسنده
چکیده
an Numbers Sean McGuinness University of Ume a September, 1994 Abstract. In this paper, we show that for p 4 if C is a clique decomposition obtained by removing maximal cliques(ie. their edges) of order at least p one by one until none remain, in which case the remaining edges are removed one by one, then the sum of the orders of the cliques in C is at most 2tp 1(n): Here tp 1(n) denotes the number of edges in the Tur an graph of order n which has no cliques of order p:
منابع مشابه
Computing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملGreedy Maximum-Clique Decompositions
A greedy clique decomposition of a graph is obtained by removing maximal cliques from a graph one by one until the graph is empty. We have recently shown that any greedy clique decomposition of a graph of order n has at most-~ cliques. A greedy max-clique decomposition is a particular kind of greedy clique decomposition where maximum cliques are removed, instead of just maximal ones. In this pa...
متن کاملOn Greedy Clique Decompositions and Set Representations of Graphs
In 1994 S. McGuinness showed that any greedy clique decomposition of an n-vertex graph has at most ⌊n2/4⌋ cliques (The greedy clique decomposition of a graph, J. Graph Theory 18 (1994) 427-430), where a clique decomposition means a clique partition of the edge set and a greedy clique decomposition of a graph is obtained by removing maximal cliques from a graph one by one until the graph is empt...
متن کاملA Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem
Clique counts reveal important properties about the structure of massive graphs, especially social networks. The simple setting of just 3-cliques (triangles) has received much attention from the research community. For larger cliques (even, say 6-cliques) the problem quickly becomes intractable because of combinatorial explosion. Most methods used for triangle counting do not scale for large cl...
متن کاملTriangulation and Clique Separator Decomposition of Claw-Free Graphs
Finding minimal triangulations of graphs is a well-studied problem with many applications, for instance as first step for efficiently computing graph decompositions in terms of clique separators. Computing a minimal triangulation can be done in O(nm) time and much effort has been invested to improve this time bound for general and special graphs. We propose a recursive algorithm which works for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 1995